Normal form - PDFSEARCH.IO - Document Search Engine

Normal form
Results: 706

#	Item
341	MEASURING PLAYERS’ LOSSES IN EXPERIMENTAL GAMES* Drew Fudenberg and David K. Levine October 7, 1996 Add to Reading List Source URL: levine.sscnet.ucla.edu Language: English - Date: 1996-12-07 20:22:50 Nash equilibrium Extensive-form game Centipede game Solution concept Outcome Strategy Determinacy Normal-form game Best response Game theory Problem solving Self-confirming equilibrium
342	MUS Extraction using Clausal Proofs Anton Belov1 , Marijn J. H. Heule2 and Joao Marques-Silva1,3 1 Complex and Adaptive Systems Laboratory, University College Dublin 2 Add to Reading List Source URL: www.cs.utexas.edu Language: English - Date: 2014-07-31 09:41:50 Mathematics Propositional calculus Unsatisfiable core Conjunctive normal form Resolution Logic programming First-order logic Logic Mathematical logic Automated theorem proving
343	Blocked Clause Elimination Matti J¨arvisalo1 , Armin Biere2 , and Marijn Heule 3 1 2 Add to Reading List Source URL: www.st.ewi.tudelft.nl Language: English - Date: 2009-12-21 10:55:55 NP-complete problems Conjunctive normal form Automated theorem proving Boolean satisfiability problem Resolution Theoretical computer science Mathematics Applied mathematics
344	Payoff Information and Self-Confirming Equilibrium1 First version: April 25, 1995 This revision: July 12, 1999 Eddie Dekel Add to Reading List Source URL: levine.sscnet.ucla.edu Language: English - Date: 1999-07-12 13:09:31 Solution concept Nash equilibrium Outcome Rationalizability Normal-form game Strategic dominance Strategy Trembling hand perfect equilibrium Information set Game theory Extensive-form game Self-confirming equilibrium
345	SOLVING THE SATISFIABILITY PROBLEM USING MESSAGE-PASSING TECHNIQUES S. J. Pumphrey, May[removed]Part III Physics Project Report) A Bayesian message-passing technique, the sum-product algorithm, is described and applied to Add to Reading List Source URL: www.inference.phy.cam.ac.uk Language: English - Date: 2001-06-07 06:04:05 Constraint programming Probability theory Boolean satisfiability problem Electronic design automation Logic in computer science Local search Bayesian inference Algorithm Conjunctive normal form Mathematics Theoretical computer science Applied mathematics
346	Blocked Clause Decomposition Marijn J. H. Heule? and Armin Biere?? The University of Texas at Austin and Johannes Kepler University Linz Abstract. We demonstrate that it is fairly easy to decompose any propositional form Add to Reading List Source URL: www.cs.utexas.edu Language: English - Date: 2014-01-02 14:11:30 Automated theorem proving Propositional calculus Boolean algebra Mathematical logic Logic in computer science Conjunctive normal form Boolean satisfiability problem Resolution Unit propagation Theoretical computer science Mathematics Logic
347	Symmetry in Gardens of Eden Christiaan Hartman Marijn J. H. Heule∗ Delft University of Technology Add to Reading List Source URL: www.cs.utexas.edu Language: English - Date: 2014-01-02 11:31:27 Boolean algebra Symmetry Logic in computer science NP-complete problems Electronic design automation Boolean satisfiability problem True quantified Boolean formula Conjunctive normal form Symmetry in mathematics Theoretical computer science Mathematics Applied mathematics
348	When is Reputation Bad?1 Jeffrey Ely Drew Fudenberg David K. Levine2 First Version: April 22, 2002 This Version: November 20, 2005 Add to Reading List Source URL: levine.sscnet.ucla.edu Language: English - Date: 2005-11-21 14:01:27 Nash equilibrium Outcome Best response Normal-form game Repeated game Strategy Bayesian game Risk dominance Game theory Problem solving Extensive-form game
349	Everything You Always Wanted to Know About Blocked Sets (But Were Afraid to Ask) Tom´ aˇs Balyo1 , Andreas Fr¨ohlich2 , Marijn J. H. Heule3 , Armin Biere2 ? Add to Reading List Source URL: www.cs.utexas.edu Language: English - Date: 2014-07-31 10:00:09 Automated theorem proving Logic in computer science Propositional calculus NP-complete problems Logic programming Boolean satisfiability problem Unit propagation Conjunctive normal form Resolution Theoretical computer science Mathematics Mathematical logic
350	EagleUP: Solving Random 3-SAT using SLS with Unit Propagation Oliver Gableske1 and Marijn Heule2 1 2 Add to Reading List Source URL: www.st.ewi.tudelft.nl Language: English - Date: 2011-09-26 11:40:37 Logic programming Conjunctive normal form Local search Boolean satisfiability problem DPLL algorithm Theoretical computer science Constraint programming Declarative programming

UPDATE